from collections import *
from sys import *
input=stdin.readline
def outl(l):
print(' '.join(map(str,l)))
def yes():
print('YES')
def no():
print('NO')
def solve():
n=int(input())
l=list(map(int,input().split()))
d=defaultdict(list)
for i in range(n):
d[l[i]//4*4].append(l[i])
for i in d:
d[i].sort(reverse=True)
l1=[]
for i in range(n):
l1.append(d[l[i]//4*4].pop())
outl(l1)
for _ in range(int(input())):
solve()
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |
1180A - Alex and a Rhombus | 445A - DZY Loves Chessboard |
1372A - Omkar and Completion | 159D - Palindrome pairs |
981B - Businessmen Problems | 1668A - Direction Change |
1667B - Optimal Partition | 1668B - Social Distance |
88B - Keyboard | 580B - Kefa and Company |
960A - Check the string | 1220A - Cards |
897A - Scarborough Fair | 1433B - Yet Another Bookshelf |
1283B - Candies Division | 1451B - Non-Substring Subsequence |